منابع مشابه
Random Walks on Random Graphs
The aim of this article is to discuss some of the notions and applications of random walks on finite graphs, especially as they apply to random graphs. In this section we give some basic definitions, in Section 2 we review applications of random walks in computer science, and in Section 3 we focus on walks in random graphs. Given a graphG = (V,E), let dG(v) denote the degree of vertex v for all...
متن کاملRandom walk on random walks
In this paper we study a random walk in a one-dimensional dynamic random environment consisting of a collection of independent particles performing simple symmetric random walks in a Poisson equilibrium with density ρ ∈ (0,∞). At each step the random walk performs a nearest-neighbour jump, moving to the right with probability p◦ when it is on a vacant site and probability p• when it is on an oc...
متن کاملErgodicity of Random Walks on Random DFA
Given a DFA we consider the random walk that starts at the initial state and at each time step moves to a new state by taking a random transition from the current state. This paper shows that for typical DFA this random walk induces an ergodic Markov chain. The notion of typical DFA is formalized by showing that ergodicity holds with high probability when a DFA is sampled uniformly at random fr...
متن کاملRandom and Pseudo-Random Walks on Graphs
Random walks on graphs have turned out to be a powerful tool in the design of algorithms and other applications. In particular, expander graphs, which are graphs on which random walks have particularly good properties, are extremely useful in complexity and other areas of computer science. In this chapter we study random walks on general regular graphs, leading to a the randomized logspace algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 1996
ISSN: 0091-1798
DOI: 10.1214/aop/1039639375